Enumerating regular objects with a given automorphism group
نویسندگان
چکیده
منابع مشابه
Vector representable matroids of given rank with given automorphism group
A simple way of as,;ociating a matroid of prescribed rank with a graph is shown. The matroids so corhstrueted are re.presentable over any sufficiently large field. Their ase is demonstrated by the fallowing result: Given an integer k >~ 3 and a hmction G associating a group with each subsel of a set S, the'e is a matroid M(E), representable ever any sufl]ciendy large field, such that E ~S, and ...
متن کاملAlgorithms for classifying regular polytopes with a fixed automorphism group
In this paper, various algorithms used in the classifications of regular polytopes for given groups are compared. First computational times and memory usages are analyzed for the original algorithm used in one of these classifications. Second, a possible algorithm for isomorphism testing among polytopes is suggested. Then, two improved algorithms are compared, and finally, results are given for...
متن کاملOn the construction of dense lattices with a given automorphism group
We consider the problem of constructing dense lattices of Rn with a given non trivial automorphism group. We exhibit a family of such lattices of density at least cn2−n, which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n, we exhibit a finite set of lattices that come with an automorphism group of size n, and a co...
متن کاملUltra regular covering space and its automorphism group
In order to classify digital spaces in terms of digital-homotopic theoretical tools, a recent paper by Han (2006b) (see also the works of Boxer and Karaca (2008) as well as Han (2007b)) established the notion of regular covering space from the viewpoint of digital covering theory and studied an automorphism group (or Deck’s discrete transformation group) of a digital covering. By using these to...
متن کاملOn the directed triple systems with a given automorphism
A directed triple system of order v, denoted DTS(v), is said to be f-bicyclic if it admits an automorphism consisting of f fixed points and two disjoint cycles. In this paper, we give necessary and sufficient conditions for the existence of f-bicyclic
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90199-3